Effective metaheuristics for the latency location routing problem

The latency location routing problem (LLRP), a combination of the facility and cumulative capacitated vehicle problem, is recently proposed variant problems. It corresponds to customer-centric in which aim minimize sum arrival times at customers. This paper proposes three novel metaheuristic algorithms solve LLRP. They use simulated annealing framework, after each temperature reduction intensified through variable neighborhood descent procedure. Each algorithm uses different search strategy as intensification. Results on 76 benchmark instances indicate that metaheurstics outperform state-of-the-art algorithms, finding new best solutions for all large-sized (over 100 customers), or currently known optimal ones most small- medium-sized instances, comparable computing times. Furthermore, more than 80% average value found by better equal current solution.